Use of Plds to Illustrate Fundamental Concepts in Switching and Logic

نویسندگان

  • Jim Grover
  • Okechukwu Ugweje
چکیده

1 Jim Grover, Electrical and Computer Engineering, University of Akron, Akron, Ohio 44325, [email protected] 2 Okechukwu Ugweje, Electrical and Computer Engineering, University of Akron, Akron OH, 44325, [email protected] Abstract  This paper discusses the application of programmable logic devices (PLDs) to enhance the understanding of digital design at the University of Akron. Switching and Logic course has often been taught as a classical engineering class where students have little or no hands-on experience, and sometimes have difficulty in understanding the basic concept. With the availability of lower-cost, digital and logic components, and test equipment, this is changing. For freshman and sophomore engineering students taking an introduction to digital design, one must make sure that error in implementation such as wiring errors do not prevent the concept of design from getting through. To ease implementation problems at the university, programmable logic devices in the form of ICT PEELsTM and PEELTM arrays are used with motherboard and daughter boards. The configuration tools are easy to use and available at no cost to the students for home use. Two and multilevel implementation are investigated for both combinational and sequential networks. The motherboard, daughter board combination was locally developed allowing their resources to closely track the accompanying laboratory exercises. By reducing wiring to a minimum laboratory, exercises can range from analysis to design and be accomplished in the allotted threehour period. The overall effectiveness of this instructional model has been positive, and this continues to be used and expanded.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How DoesStrawson Unify Epistemology, Ontology and Logic

Strawson’s conception of analysis as a ‘connective linguistic analysis’ makes it possible for him to achieve an indefinitely large range of ideas or concepts among them are certain numbers of fundamental, general and pervasive concepts or concept-types which not only are pre-theoretical or ahistorical, but also together constitute a structural framework only within whichlogic, ontology and epis...

متن کامل

Prediction and evaluation of runoff data in south of Qazvin watershed, using a fuzzy logic technique

The important criteria for designing in the most of hydrologic and hydraulic construction projects are based on runoff or peak-flow of water. Mostly, this measure and criterion is calculated or estimated by stochastic data. Another feature of these data that are used in watershed hydrological studies is their impreciseness. Therefore, in this study, in order to deal with uncertainty and impreci...

متن کامل

TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

متن کامل

Designing and Modeling a Control System for Aircraft in the Presence of Wind Disturbance (TECHNICAL NOTE)

This paper proposes a switching adaptive control for trajectory tracking of unmanned aircraft systems. The switching adaptive control method is designed to overcome the wind disturbance and achieve a proper tracking performance for control systems. In the suggested system, the wind disturbance is regarded as a finite set of uncertainties; a controller is designed for each uncertainty, and a per...

متن کامل

Restricted cascade and wreath products of fuzzy finite switchboard state machines

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002